Estimating continuous affect with label uncertainty

Continuous affect estimation is a problem where there is an inherent uncertainty and subjectivity in the labels that accompany data samples -- typically, datasets use the average of multiple annotations or self-reporting to obtain ground truth labels. In this work, we propose a method for uncertainty-aware continuous affect estimation, that models explicitly the uncertainty of the ground truth label as a uni-variate Gaussian with mean equal to the ground truth label, and unknown variance. For each sample, the proposed neural network estimates not only the value of the target label (valence and arousal in our case), but also the variance. The network is trained with a loss that is defined as the KL-divergence between the estimation (valence/arousal) and the Gaussian around the ground truth. We show that, in two affect recognition problems with real data, the estimated variances are correlated with measures of uncertainty/error in the labels that are extracted by considering multiple annotations of the data

Linear Maximum Margin Classifier for Learning from Uncertain Data

In this paper, we propose a maximum margin classifier that deals with uncertainty in data input. More specifically, we reformulate the SVM framework such that each training example can be modeled by a multi-dimensional Gaussian distribution described by its mean vector and its covariance matrix -- the latter modeling the uncertainty. We address the classification problem and define a cost function that is the expected value of the classical SVM cost when data samples are drawn from the multi-dimensional Gaussian distributions that form the set of the training examples. Our formulation approximates the classical SVM formulation when the training examples are isotropic Gaussians with variance tending to zero. We arrive at a convex optimization problem, which we solve efficiently in the primal form using a stochastic gradient descent approach. The resulting classifier, which we name SVM with Gaussian Sample Uncertainty (SVM-GSU), is tested on synthetic data and five publicly available and popular datasets; namely, the MNIST, WDBC, DEAP, TV News Channel Commercial Detection, and TRECVID MED datasets. Experimental results verify the effectiveness of the proposed method.Comment: IEEE Transactions on Pattern Analysis and Machine Intelligence. (c) 2017 IEEE. DOI: 10.1109/TPAMI.2017.2772235 Author's accepted version. The final publication is available at http://ieeexplore.ieee.org/document/8103808

A novel approach for protection of radial and meshed microgrids

During grid-connected operation mode of microgrids, since the main grid provides a large short-circuit current to the fault point, the protection can be performed by the conventional protective devices, but in islanded mode, fault currents are drastically lower than those of grid-connected mode. Hence, employment of traditional overcurrent-based protective devices in micro-grids is no longer valid and some alternative protection schemes should be developed. This paper presents a micro-grid protection scheme based on positive-sequence component using Phasor Measurement Units (PMUs) and a Central Protection Unit (CPU). The salient feature of the proposed scheme in comparison with the previous works is that it has the ability to protect both radial and meshed micro-grids against different types of faults. Furthermore, since the CPU is capable of updating its pickup values (upstream and downstream equivalent positive-sequence impedances of each line) after the first change in the micro-grid configuration (such as transferring from grid-connected to islanded mode and or disconnection of a line, bus, or DER either in grid-connected mode or in islanded mode), it can protect micro-grid against subsequent faults. In order to verify the effectiveness of the proposed scheme and the CPU, several simulations have been undertaken by using DIgSILENT PowerFactory and MATLAB software packages

Practical risk assessment of the relaxation of LOM protection settings in NIE networks' distribution system

This paper presents methodology, experience and practical outcomes of the risk assessment-based revision of Loss-OfMains (LOM) protection settings in NIE Networks’ distribution system. An investigative project has been undertaken by the authors to revise the current LOM practice as recommended by the G59/1/NI regulation, and to propose the settings which would meet the all-Ireland transmission system stability criteria. It is also important to ensure that any increased personal risk is realistically quantified and satisfies the Health and Safety requirements. Both aspects (i.e. LOM protection stability and sensitivity) are covered in the paper. The results and observations included in the paper aim to provide the means and supporting evidence for achieving best compromise in the revision of LOM protection settings

A deep generic to specific recognition model for group membership analysis using non-verbal cues

Automatic understanding and analysis of groups has attracted increasing attention in the vision and multimedia communities in recent years. However, little attention has been paid to the automatic analysis of the non-verbal behaviors and how this can be utilized for analysis of group membership, i.e., recognizing which group each individual is part of. This paper presents a novel Support Vector Machine (SVM) based Deep Specific Recognition Model (DeepSRM) that is learned based on a generic recognition model. The generic recognition model refers to the model trained with data across different conditions, i.e., when people are watching movies of different types. Although the generic recognition model can provide a baseline for the recognition model trained for each specific condition, the different behaviors people exhibit in different conditions limit the recognition performance of the generic model. Therefore, the specific recognition model is proposed for each condition separately and built on the top of the generic recognition model. We conduct a set of experiments using a database collected to study group analysis while each group (i.e., four participants together) were watching a number of long movie segments. The proposed deep specific recognition model (44%) outperforms the generic recognition model (26%). The recognition of group membership also indicates that the non-verbal behaviors of individuals within a group share commonalities

WarpedGANSpace: Finding non-linear RBF paths in GAN latent space

This work addresses the problem of discovering, in an unsupervised manner, interpretable paths in the latent space of pretrained GANs, so as to provide an intuitive and easy way of controlling the underlying generative factors. In doing so, it addresses some of the limitations of the state-of-the-art works, namely, a) that they discover directions that are independent of the latent code, i.e., paths that are linear, and b) that their evaluation relies either on visual inspection or on laborious human labeling. More specifically, we propose to learn non-linear warpings on the latent space, each one parametrized by a set of RBF-based latent space warping functions, and where each warping gives rise to a family of non-linear paths via the gradient of the function. Building on the work of Voynov and Babenko that discovers linear paths, we optimize the trainable parameters of the set of RBFs, so as that images that are generated by codes along different paths, are easily distinguishable by a discriminator network. This leads to easily distinguishable image transformations, such as pose and facial expressions in facial images. We show that linear paths can be derived as a special case of our method, and show experimentally that non-linear paths in the latent space lead to steeper, more disentangled and interpretable changes in the image space than in state-of-the art methods, both qualitatively and quantitatively. We make the code and the pretrained models publicly available at: https://github.com/chi0tzp/WarpedGANSpace

WarpedGANSpace: Finding non-linear RBF paths in GAN latent space

This work addresses the problem of discovering, in an unsupervised manner, interpretable paths in the latent space of pretrained GANs, so as to provide an intuitive and easy way of controlling the underlying generative factors. In doing so, it addresses some of the limitations of the state-of-the-art works, namely, a) that they discover directions that are independent of the latent code, i.e., paths that are linear, and b) that their evaluation relies either on visual inspection or on laborious human labeling. More specifically, we propose to learn non-linear warpings on the latent space, each one parametrized by a set of RBF-based latent space warping functions, and where each warping gives rise to a family of non-linear paths via the gradient of the function. Building on the work of [34], that discovers linear paths, we optimize the trainable parameters of the set of RBFs, so as that images that are generated by codes along different paths, are easily distinguishable by a discriminator network. This leads to easily distinguishable image transformations, such as pose and facial expressions in facial images. We show that linear paths can be derived as a special case of our method, and show experimentally that non-linear paths in the latent space lead to steeper, more disentangled and interpretable changes in the image space than in state-of-the art methods, both qualitatively and quantitatively. We make the code and the pretrained models publicly available at: https://github.com/chi0tzp/WarpedGANSpace

What do haematological cancer survivors want help with? A cross-sectional investigation of unmet supportive care needs

BACKGROUND: This study aimed to identify the most prevalent unmet needs of haematological cancer survivors. METHODS: Haematological cancer survivors aged 18–80 years at time of recruitment were selected from four Australian state cancer registries. Survivors completed the Survivor Unmet Needs Survey. The most frequently reported “high/very high” unmet needs items were identified, as well as characteristics associated with the three most prevalent “high/very high” unmet needs reported by haematological cancer survivors. RESULTS: A total of 715 eligible survivors returned a completed survey. “Dealing with feeling tired” (17%), was the most frequently endorsed “high/very high” unmet need. Seven out of the ten most frequently endorsed unmet needs related to emotional health. Higher levels of psychological distress (e.g., anxiety, depression and stress) and indicators of financial burden as a result of cancer (e.g., having used up savings and trouble meeting day-to-day expenses due to cancer) were consistently identified as characteristics associated with the three most prevalent “high/very high” unmet needs. CONCLUSIONS: A minority of haematological cancer survivors endorsed a “high/very high” unmet need on individual items. Additional emotional support may be needed by a minority of survivors. Survivors reporting high levels of psychological distress or those who experience increased financial burden as a result of their cancer diagnosis may be at risk of experiencing the most prevalent “high/very high” unmet needs identified by this study.This project was co-funded by beyondblue and Cancer Australia (Grant ID: 569290)

HyperReenact: one-shot reenactment via jointly learning to refine and retarget faces

In this paper, we present our method for neural face reenactment, called HyperReenact, that aims to generate realistic talking head images of a source identity, driven by a target facial pose. Existing state-of-the-art face reenactment methods train controllable generative models that learn to synthesize realistic facial images, yet producing reenacted faces that are prone to significant visual artifacts, especially under the challenging condition of extreme head pose changes, or requiring expensive few-shot fine-tuning to better preserve the source identity characteristics. We propose to address these limitations by leveraging the photorealistic generation ability and the disentangled properties of a pretrained StyleGAN2 generator, by first inverting the real images into its latent space and then using a hypernetwork to perform: (i) refinement of the source identity characteristics and (ii) facial pose re-targeting, eliminating this way the dependence on external editing methods that typically produce artifacts. Our method operates under the one-shot setting (i.e., using a single source frame) and allows for cross-subject reenactment, without requiring any subject-specific fine-tuning. We compare our method both quantitatively and qualitatively against several state-of-the-art techniques on the standard benchmarks of VoxCeleb1 and VoxCeleb2, demonstrating the superiority of our approach in producing artifact-free images, exhibiting remarkable robustness even under extreme head pose changes. We make the code and the pretrained models publicly available at: https://github.com/ StelaBou/HyperReenact

Attribute-Preserving Face Dataset Anonymization via Latent Code Optimization

This work addresses the problem of anonymizing the identity of faces in a dataset of images, such that the privacy of those depicted is not violated, while at the same time the dataset is useful for downstream task such as for training machine learning models. To the best of our knowledge, we are the first to explicitly address this issue and deal with two major drawbacks of the existing state-of-the-art approaches, namely that they (i) require the costly training of additional, purpose-trained neural networks, and/or (ii) fail to retain the facial attributes of the original images in the anonymized counterparts, the preservation of which is of paramount importance for their use in downstream tasks. We accordingly present a task-agnostic anonymization procedure that directly optimizes the images' latent representation in the latent space of a pretrained GAN. By optimizing the latent codes directly, we ensure both that the identity is of a desired distance away from the original (with an identity obfuscation loss), whilst preserving the facial attributes (using a novel feature-matching loss in FaRL's [48] deep feature space). We demonstrate through a series of both qualitative and quantitative experiments that our method is capable of anonymizing the identity of the images whilst-crucially-better-preserving the facial attributes. We make the code and the pretrained models publicly available at: https://github.com/chi0tzp/FALCO